Optimizing binary trees grown with a sorting algorithm

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

Adaptive Sorting with AVL Trees

A new adaptive sorting algorithm is introduced. The new implementation relies on using the traditional AVL trees, and has the same performance limitations. More precisely, the number of comparisons performed by our algorithm, on an input sequence of length n that has I inversions, is at most 1.44n lg I n + O(n) . Our algorithm runs in time O(n log I n ) and is practically efficient and easy to ...

A Note On Rémy's Algorithm For Generating Random Binary Trees

A Genetic Algorithm for Constructing Compact Binary Decision Trees

Abstract Tree-based classifiers are important in pattern recognition and have been well studied. Although the problem of finding an optimal decision tree has received attention, it is a hard optimization problem. Here we propose utilizing a genetic algorithm to improve on the finding of compact, near-optimal decision trees. We present a method to encode and decode a decision tree to and from a ...

Time-optimal Binary Number Sorting Algorithm on a Completely Overlapping Network with Latency Hiding

This paper presents yet another kind of binary number sorting algorithms on a new theoretical network called a completely overlapping network (CON). This new network model has an applicable potential in real-life applications because it is an extension of LANs that are widely used at present. In this paper an optimal binary number sorting algorithm on CON is illustrated. To gain even more perfo...